github.com/andybalholm/brotli/matchfinder.M0.hash (method)

10 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		m0.go#L33: func (m M0) hash(data uint64) uint64 {
		m0.go#L67: 	nextHash := m.hash(binary.LittleEndian.Uint64(src[s:]))
		m0.go#L99: 			nextHash = m.hash(binary.LittleEndian.Uint64(src[nextS:]))
		m0.go#L115: 			h := m.hash(binary.LittleEndian.Uint64(src[newBase:]))
		m0.go#L150: 				table[m.hash(x)&m0TableMask] = uint16(i)
		m0.go#L155: 			table[m.hash(x)&m0TableMask] = uint16(base + 1)
		m0.go#L161: 		table[m.hash(x)&m0TableMask] = uint16(s - 3)
		m0.go#L162: 		table[m.hash(x>>8)&m0TableMask] = uint16(s - 2)
		m0.go#L163: 		prevHash := m.hash(x >> 16)
		m0.go#L165: 		nextHash = m.hash(x >> 24)